Improved stability predictions in milling through more realistic load conditions
نویسندگان
چکیده
منابع مشابه
Toward more realistic drug–target interaction predictions
A number of supervised machine learning models have recently been introduced for the prediction of drug-target interactions based on chemical structure and genomic sequence information. Although these models could offer improved means for many network pharmacology applications, such as repositioning of drugs for new therapeutic uses, the prediction models are often being constructed and evaluat...
متن کاملImproved Variogram Models for More Realistic Estimation and Simulation
Geostatistical models often require a variogram or covariance model for kriging and krigingbased simulation. Next to the initial decision of stationarity, the choice of an appropriate variogram model is the most important decision in a geostatistical study. Common practice consists of fitting experimental variograms with a nested combination of proven models such as the spherical, exponential, ...
متن کاملRealistic CPU Workloads through Host Load Trace Playback
This paper introduces host load trace playback, a new technique for generating a background workload from a trace of the Unix load average that results in realistic and repeatable CPU contention behavior. Such workloads are invaluable for evaluating various forms of distributed middleware, including resource prediction systems and application-level schedulers. We describe the technique and then...
متن کاملImproved free-energy parameters for predictions of RNA duplex stability.
Thermodynamic parameters for prediction of RNA duplex stability are reported. One parameter for duplex initiation and 10 parameters for helix propagation are derived from enthalpy and free-energy changes for helix formation by 45 RNA oligonucleotide duplexes. The oligomer sequences were chosen to maximize reliability of secondary structure predictions. Each of the 10 nearest-neighbor sequences ...
متن کاملTowards More Realistic ANTS
In this paper, we summarize our results on a variant of the Ants Nearby Treasure Search (ANTS) problem, where n mobile agents, controlled by asynchronous randomized finite automata, search collaboratively for a treasure hidden by an adversary. We show that despite these restrictions, the treasure can be located in an optimal run-time of O(D + D2/n). Moreover, we consider slight variations of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia CIRP
سال: 2018
ISSN: 2212-8271
DOI: 10.1016/j.procir.2018.08.231